Constructive proofs of the range property in lambda calculus
نویسندگان
چکیده
منابع مشابه
Constructive Proofs of the Range Property in lambda-Calculus
Barendregt, H., Constructive proofs of the range property in lambda calculus. Theoretical Computer Science 121 (1993) 59-69. Bohm (1968) conjectured that the range of a combinator is either a singleton or an infinite set. The conjecture was proved independently by My hill and the author. A proof is presented in Barendregt (1984) in a powerful but somewhat difficult to understand topological for...
متن کاملConstructive Data Refinement in Typed Lambda Calculus
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constructive element. Constructive data refinement is shown to have desirable properties, and a substantial example of refinement is presented.
متن کاملConstructive Data Reenement in Typed Lambda Calculus
A new treatment of data reenement in typed lambda calculus is proposed, based on pre-logical relations HS99] rather than logical relations as in Ten94], and incorporating a constructive element. Constructive data reenement is shown to have desirable properties, and a substantial example of reenement is presented.
متن کاملFormal SOS-Proofs for the Lambda-Calculus
We describe in this paper formalisations for the properties of weakening, type-substitutivity, subject-reduction and termination of the usual big-step evaluation relation. Our language is the lambda-calculus whose simplicity allows us to show actual theorem-prover code of the formal proofs. The formalisations are done in Nominal Isabelle, a definitional extention of the theorem prover Isabelle/...
متن کاملThe Borsuk-Ulam-property, Tucker-property and constructive proofs in combinatorics
This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group G is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90083-6